Dynamic programming processes within dynamic programming processes
نویسندگان
چکیده
منابع مشابه
Faster Dynamic Programming for Markov Decision Processes
Markov decision processes (MDPs) are a general framework used in artificial intelligence (AI) to model decision theoretic planning problems. Solving real world MDPs has been a major and challenging research topic in the AI literature, since classical dynamic programming algorithms converge slowly. We discuss two approaches in expediting dynamic programming. The first approach combines heuristic...
متن کاملMarkov Decision Processes: Discrete Stochastic Dynamic Programming
The Wiley-Interscience Paperback Series consists of selected books that have been made more accessible to consumers in an effort to increase global appeal and general circulation. With these new unabridged softcover...
متن کاملDynamic programming in constrained Markov decision processes
We consider a discounted Markov Decision Process (MDP) supplemented with the requirement that another discounted loss must not exceed a specified value, almost surely. We show that the problem can be reformulated as a standard MDP and solved using the Dynamic Programming approach. An example on a controlled queue is presented. In the last section, we briefly reinforce the connection of the Dyna...
متن کاملEecient Dynamic-programming Updates in Partially Observable Markov Decision Processes Eecient Dynamic-programming Updates in Partially Observable Markov Decision Processes
We examine the problem of performing exact dynamic-programming updates in partially observable Markov decision processes (pomdps) from a computational complexity viewpoint. Dynamic-programming updates are a crucial operation in a wide range of pomdp solution methods and we nd that it is intractable to perform these updates on piecewise-linear convex value functions for general pomdps. We offer ...
متن کاملEecient Dynamic-programming Updates in Partially Observable Markov Decision Processes
We examine the problem of performing exact dynamic-programming updates in partially observable Markov decision processes (pomdps) from a computational complexity viewpoint. Dynamic-programming updates are a crucial operation in a wide range of pomdp solution methods and we nd that it is intractable to perform these updates on piecewise-linear convex value functions for general pomdps. We offer ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1969
ISSN: 0022-247X
DOI: 10.1016/0022-247x(69)90205-4